Multilayer Drawings of Clustered Graphs
نویسندگان
چکیده
منابع مشابه
Multilayer Drawings of Clustered Graphs
The cluster adjacency graph of a flat clustered graph C(G, T ) is the graph A whose vertices are the clusters in T and whose edges connect clusters containing vertices that are adjacent in G. A multilayer drawing of a clustered graph C consists of a straight-line c-planar drawing of C in which the clusters are drawn as convex regions and of a straight-line planar drawing of A such that each ver...
متن کاملStraight-Line Rectangular Drawings of Clustered Graphs
We show that every c-planar clustered graph has a straight-line c-planar drawing in which each cluster is represented by an axis-parallel rectangle, thus solving a problem posed by Eades, Feng, Lin, and Nagamochi [Algorithmica, 2006 ].
متن کاملStraightening Drawings of Clustered Hierarchical Graphs
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V,E) with an assignment of the vertices to horizontal layers, a plane drawing of G (with y-monotone edges) can be specified by stating for each layer the order of the vertices lying on and the edges intersecting that layer. Given these orders and a recursive partition of the vertices int...
متن کاملConvex drawings of hierarchical planar graphs and clustered planar graphs
Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, software visualisation and visualisation of social networks and biological networks. Straight-line drawing algorithms for hierarchical graphs and clustered graphs have been presented in [P. Eades, Q. Feng, X. Lin and H. Nag...
متن کاملMonotone Drawings of Graphs
We study a new standard for visualizing graphs: A monotone drawing is a straight-line drawing such that, for every pair of vertices, there exists a path that monotonically increases with respect to some direction. We show algorithms for constructing monotone planar drawings of trees and biconnected planar graphs, we study the interplay between monotonicity, planarity, and convexity, and we outl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2014
ISSN: 1526-1719
DOI: 10.7155/jgaa.00340